Importance sampling for stochastic quantum simulations
نویسندگان
چکیده
Simulating many-body quantum systems is a promising task for computers. However, the depth of most algorithms, such as product formulas, scales with number terms in Hamiltonian, and can therefore be challenging to implement on near-term, well early fault-tolerant devices. An efficient solution given by stochastic compilation protocol known qDrift, which builds random formulas sampling from Hamiltonian according coefficients. In this work, we unify qDrift importance sampling, allowing us sample arbitrary probability distributions, while controlling both bias, statistical fluctuations. We show that simulation cost reduced achieving same accuracy, considering individual during stage. Moreover, incorporate recent work composite channel compute rigorous bounds bias variance, showing how choose samples, experiments, time steps target accuracy. These results lead more implementation protocol, without use channels. Theoretical are confirmed numerical simulations performed lattice nuclear effective field theory.
منابع مشابه
Importance Sampling for Stochastic Timed Automata
We present an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata. By means of symbolic exploration, our framework first identifies states that cannot reach the goal. A state-wise change of measure is then applied on-thefly during simulations, ensuring that dead ends are never reach...
متن کاملStochastic Optimization with Importance Sampling
Uniform sampling of training data has been commonly used in traditional stochastic optimization algorithms such as Proximal Stochastic Gradient Descent (prox-SGD) and Proximal Stochastic Dual Coordinate Ascent (prox-SDCA). Although uniform sampling can guarantee that the sampled stochastic quantity is an unbiased estimate of the corresponding true quantity, the resulting estimator may have a ra...
متن کاملAdaptive Importance Sampling via Stochastic Convex Programming
We show that the variance of the Monte Carlo estimator that is importance sampled from an exponential family is a convex function of the natural parameter of the distribution. With this insight, we propose an adaptive importance sampling algorithm that simultaneously improves the choice of sampling distribution while accumulating a Monte Carlo estimate. Exploiting convexity, we prove that the m...
متن کاملPermuted Product and Importance-Sampling Estimators for Regenerative Simulations
In a previous paper we introduced a new variance-reduction technique for regenerative simulations based on permuting regeneration cycles. In this paper we apply this idea to new classes of estimators. In particular, we derive permuted versions of likelihood-ratio derivative estimators for steady-state performance measures, importance-sampling estimators of the mean cumulative reward until hitti...
متن کاملSequential Importance Sampling Algorithms for Dynamic Stochastic Programming
This paper gives a comprehensive treatment of EVPI-based sequential importance sampling algorithms for dynamic (multistage) stochastic programming problems. Both theory and computational algorithms are discussed. Under general assumptions it is shown that both expected value of perfect information (EVPI) processes and the marginal EVPI process (the supremum norm of the conditional expectation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum
سال: 2023
ISSN: ['2521-327X']
DOI: https://doi.org/10.22331/q-2023-04-13-977